package Cqeue;

import java.util.LinkedList;

class Cqeue{//但
    LinkedList<Integer> stack= new LinkedList<>(); //单个栈来模拟队列 ！
    public Cqeue(){
        LinkedList<Integer> stack = new LinkedList<>();
    }
    public void appendTail(int value){
        stack.addLast(value);// 入队
    }
    public int deleteHead(){
        return stack.size()==0?-1:stack.removeFirst();//这不是出队么？移除并且返回第一个元素
    }
}
public class Main {
}
